Fast algorithms for robust classification with Bayesian nets
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Robust Classification with Bayesian Nets
We focus on a well-known classification task with expert systems based on Bayesian networks: predicting the state of a target variable given an incomplete observation of the other variables in the network, i.e., an observation of a subset of all the possible variables. To provide conclusions robust to near-ignorance about the process that prevents some of the variables from being observed, it h...
متن کاملFast training algorithms for multilayer neural nets
An algorithm that is faster than back-propagation and for which it is not necessary to specify the number of hidden units in advance is described. The relationship with other fast pattern-recognition algorithms, such as algorithms based on k-d trees, is discussed. The algorithm has been implemented and tested on artificial problems, such as the parity problem, and on real problems arising in sp...
متن کاملLikelihood-Based Robust Classification with Bayesian Networks
Bayesian networks are commonly used for classification: a structural learning algorithm determines the network graph, while standard approaches estimate the model parameters from data. Yet, with few data the corresponding assessments can be unreliable. To gain robustness in this phase, we consider a likelihood-based learning approach, which takes all the model quantifications whose likelihood e...
متن کاملFast Algorithms for Bayesian Independent Component Analysis
Fast algorithms for linear blind source separation are developed. The fast convergence is rst derived from low-noise approximation of the EM-algorithm given in 2], to which a modiication is made that leads as a special case to the FastICA algorithm 5]. The modii-cation is given a general interpretation and is applied to Bayesian blind source separation of noisy signals.
متن کاملRandomized Algorithms for Fast Bayesian Hierarchical Clustering
We present two new algorithms for fast Bayesian Hierarchical Clustering on large data sets. Bayesian Hierarchical Clustering (BHC) [1] is a method for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. BHC has several advantages over traditional distancebased agglomerative clustering algorithms. It defines a probabilistic model of the data a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2007
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2006.07.011